DEPENDENCY, MODELS, AND RECIPROCITY1
نویسندگان
چکیده
منابع مشابه
Utilizing Dependency Language Models for Graph-based Dependency Parsing Models
Most previous graph-based parsing models increase decoding complexity when they use high-order features due to exact-inference decoding. In this paper, we present an approach to enriching high-order feature representations for graph-based dependency parsing models using a dependency language model and beam search. The dependency language model is built on a large-amount of additional autoparsed...
متن کاملLatent Dependency Forest Models
Figure 1: All possible pairwise dependencies between the three variables and a root node. Each dependency has a weight and only the dependencies with non-zero weights are shown. The weight ws|xi , which is the probability of generating a stop node given the assignment Xi = xi is not drawn for simplicity, but it can be computed using the normalization condition discussed in the LDFM-S subsection...
متن کاملCharacterizations of Decomposable Dependency Models
Decomposable dependency models possess a number of interesting and useful properties. This paper presents new characterizations of decomposable models in terms of independence relationships, which are obtained by adding a single axiom to the well-known set characterizing dependency models that are isomorphic to undirected graphs. We also brie y discuss a potential application of our results to ...
متن کاملCharacterizations of Decomposable Dependency Models
Decomposable dependency models possess a number of interesting and useful properties. This paper presents new characterizations of decomposable models in terms of independence relationships, which are obtained by adding a single axiom to the well-known set characterizing dependency models that are isomorphic to undirected graphs. We also brieey discuss a potential application of our results to ...
متن کاملDependency Quantified Horn Formulas: Models and Complexity
Dependency quantified Boolean formulas (DQBF ) extend quantified Boolean formulas with Henkin-style partially ordered quantifiers. It has been shown that this is likely to yield more succinct representations at the price of a computational blow-up from PSPACE to NEXPTIME. In this paper, we consider dependency quantified Horn formulas (DQHORN ), a subclass of DQBF, and show that the computationa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ETS Research Bulletin Series
سال: 1967
ISSN: 0424-6144
DOI: 10.1002/j.2333-8504.1967.tb00364.x